Solving norm equations in relative number fields using S-units
نویسنده
چکیده
In this paper, we are interested in solving the so-called norm equation NL/K(x) = a, where L/K is a given arbitrary extension of number fields and a a given algebraic number of K. By considering S-units and relative class groups, we show that if there exists at least one solution (in L, but not necessarily in ZL), then there exists a solution for which we can describe precisely its prime ideal factorization. In fact, we prove that under some explicit conditions, the S-units that are norms are norms of S-units. This allows us to limit the search for rational solutions to a finite number of tests, and we give the corresponding algorithm. When a is an algebraic integer, we also study the existence of an integral solution, and we can adapt the algorithm to this case.
منابع مشابه
On solving relative norm equations in algebraic number fields
Let Q ⊆ E ⊆ F be algebraic number fields and M ⊂ F a free oE -module. We prove a theorem which enables us to determine whether a given relative norm equation of the form |NF/E (η)| = |θ| has any solutions η ∈ M at all and, if so, to compute a complete set of nonassociate solutions. Finally we formulate an algorithm using this theorem, consider its algebraic complexity and give some examples.
متن کاملAn Enhanced Flux Treatment in Solving Incompressible Flow in a Forward-Facing Step
The aim of this paper is to give a detailed effect of several parameters such as step height, Reynolds number, contraction ratio, and temperature difference between the entrance and solid boundaries, of a forward-facing step. An accurate length of separation and reattachment zones are achieved. A finite-volume method (FVM) has been developed to study incompressible flow in a forward-facing step...
متن کاملSolving fuzzy differential equations by using Picard method
In this paper, The Picard method is proposed to solve the system of first-order fuzzy differential equations $(FDEs)$ with fuzzy initial conditions under generalized $H$-differentiability. Theexistence and uniqueness of the solution and convergence of theproposed method are proved in details. Finally, the method is illustrated by solving some examples.
متن کاملEfficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
This paper gives polynomial time quantum algorithms for computing the ideal class group (CGP) under the Generalized Riemann Hypothesis and solving the principal ideal problem (PIP) in number fields of arbitrary degree. These are are fundamental problems in number theory and they are connected to many unproven conjectures in both analytic and algebraic number theory. Previously the best known al...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 71 شماره
صفحات -
تاریخ انتشار 2002